Langages algébriques de mots biinfinis

Des grammaires de graphes contextuelles qui charactérisent les langages contextuels

Deterministic graph grammars generate a family of infinite graphs which characterize context-free (word) languages. In this paper we presents a context-sensitive extension of these grammars. We achieve a characterization of context-sensitive (word) languages. We show that this characterization is not straightforward and that unless having some rigorous restrictions, contextual graph grammars ge...

Langages Algébriques et Systèmes de Réécriture Rationells

— In this paper, a new methodfor generating languages is introduced. It consists of the définition ofafinite number ofrules ofthe type: fug may be replacedby fvg iffbelongs to a given regular language. It is proved that any de terminis tic language which is prefix can be generated starting from finite sets anditerating such rules. Conversely under suitable hypotheses on the R(u, v) the language...

On Rational Graphs

Using rationality, like in language theory, we de ne a family of in nite graphs. This family is a strict extension of the context-free graphs of Muller and Schupp, the equational graphs of Courcelle and the pre x recognizable graphs of Caucal. We give basic properties, as well as an internal and an external characterization of these graphs. We also show that their traces form an AFL of recursiv...

An overview of CADP 2001

Cadp is a toolbox for specifying and verifying asynchronous finite-state systems described using process algebraic languages. It offers a wide range of state-of-the-art functionalities assisting the user throughout the design process: compilation, rapid prototyping, interactive and guided simulation, verification by equivalence/preorder checking and temporal logic model-checking, and test gener...

Une Caractérisation des Langages Algébriques Bornés